#include <stdio.h>

//https://leetcode.cn/problems/max-consecutive-ones/

int findMaxConsecutiveOnes(int* nums, int numsSize) {
    int count = 0;
    int countMax = 0;
    for (int i = 0; i < numsSize; i++) {
        if (nums[i] == 1) {
            count++;
        } else {
            if (count > countMax) {
                countMax = count;
                count = 0;
            } else {
                count = 0;
            }
        }
    }
    if (count > countMax) {
        countMax = count;
    }
    return countMax;
}

int main() {

    return 0;
}